minimax algorithm meaning in Hindi

Examples

1. Type A programs would use a " minimax algorithm.
2. Experiments with random trees show it to be the most efficient minimax algorithm.
3. Take the minimax algorithm for example.
4. The algorithm can be thought of as exploring the impractical to completely analyze games such as chess using the minimax algorithm.
5. The design of Blondie24 is based on a minimax algorithm of the checkers game tree in which the evaluation function is an artificial neural network.
6. The minimax algorithm is an adversarial search algorithm that is popularly used in games that require more than one player to compete against each other.
7. In other words, higher heuristic values always represent situations more favorable for player A . This is the same behavior as the normal minimax algorithm.
8. The neural net receives as input a vector representation of the checkerboard positions and returns a single value which is passed on to the minimax algorithm.
9. Alpha-beta pruning can decrease the number of nodes the negamax algorithm evaluates in a search tree in a manner similar with its use with the minimax algorithm.
10. Given the rules of any two-person game with a finite number of positions, one can always trivially construct a minimax algorithm that would exhaustively traverse the game tree.